On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invariant Kekulé structures in fullerene graphs

Fullerene graphs are trivalent plane graphs with only hexagonal and pentagonal faces. They are often used to model large carbon molecules: each vertex represents a carbon atom and the edges represent chemical bonds. A totally symmetric Kekulé structure in a fullerene graph is a set of independent edges which is fixed by all symmetries of the fullerene and molecules with totally symmetric Kekulé...

متن کامل

Unicyclic graphs with maximal energy

Let G be a graph on n vertices and let λ1, λ2, . . . , λn be its eigenvalues. The energy of G is defined as E(G) = |λ1| + |λ2| + · · · + |λn|. For various classes of unicyclic graphs, the graphs with maximal energy are determined. Let P 6 n be obtained by connecting a vertex of the circuit C6 with a terminal vertex of the path Pn−6. For n 7, P 6 n has the maximal energy among all connected unic...

متن کامل

On minimal energy of bipartite unicyclic graphs of a given bipartition

The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. In the paper, we characterize the graphs with minimal energy in the class of bipartite unicyclic graphs of a given (p, q)–bipartition, where q ≥ p ≥ 2.

متن کامل

On the Eccentric Connectivity Index of Unicyclic Graphs

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

متن کامل

On reverse degree distance of unicyclic graphs

The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2009

ISSN: 0166-218X

DOI: 10.1016/j.dam.2008.04.003